#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 2e5+10;
int num[maxn];
int main()
{
	int n,a,b,k;
	int cnt = 0;
	int ans = 0;
	cin>>n>>a>>b>>k;
	for(int i = 0;i<n;i++)
	{
		int sum = a+b;
		int mod;
		int ti; 
		int x;
		cin>>x;
		ti = x/sum;
		mod = x%sum;
		if(mod==0) mod += sum;
		if(mod<=a) ans++;
		else 
		{
			num[cnt] = mod/a;
			if(mod%a) num[cnt]++;
			num[cnt]--;
			cnt++;
		}
	}
	sort(num,num+cnt);
	for(int i = 0;i<cnt&&k>0;i++)
	{
		k -= num[i];
		if(k>=0) ans++;
	}
	cout<<ans<<endl;
}
